Automatic Search of Truncated Impossible Differentials and Applications

نویسندگان

  • Shengbao Wu
  • Mingsheng Wang
چکیده

Finding the longest impossible differentials is an essential assignment in proceeding impossible differential cryptanalysis. In this paper, we introduce a novel tool to search the longest truncated impossible differentials for word-oriented block ciphers with bijective S-boxes. It costs polynomial time to return a flag indicating whether a truncated differential is impossible under several filter conditions. To demonstrate the strength of our tool, we show that it allows to automatically find the longest truncated impossible differentials for many word-oriented block ciphers. It independently rediscovers all known truncated impossible differentials on nine round CLEFIA. What’s more, it finds new and longest truncated impossible differentials for the AES, ARIA, Camellia without FL and FL−1 layers, E2, MIBS, LBlock and Piccolo. Finally, we give an impossible differential of 14-round LBlock to illustrate that our tool is more powerful than the U-method and UID-method. We expect that the tool proposed in this paper will be useful for evaluating the security of block ciphers against impossible differentials, especially when one tries to design a word-oriented block cipher with bijective S-boxes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Search of Truncated Impossible Differentials for Word-Oriented Block Ciphers (Full Version)

Impossible differential cryptanalysis is a powerful technique to recover the secret key of block ciphers by exploiting the fact that in block ciphers specific input and output differences are not compatible. This paper introduces a novel tool to search truncated impossible differentials for word-oriented block ciphers with bijective Sboxes. Our tool generalizes the earlier U-method and the UID-...

متن کامل

New Automatic Search Tool for Impossible Differentials and Zero-Correlation Linear Approximations

Impossible differential cryptanalysis and zero-correlation linear cryptanalysis are two of the most useful cryptanalysis methods in the field of symmetric ciphers. Until now, there are several automatic search tools for impossible differentials such as U-method and UID-method, which are all independent of the non-linear S-boxes. Since the differential and linear properties can also contribute t...

متن کامل

Cryptanalysis of Reduced-Round Midori64 Block Cipher

Midori is a hardware-oriented lightweight block cipher designed by Banik et al. in ASIACRYPT 2015. It has two versions according to the state sizes, i.e. Midori64 and Midori128. In this paper, we explore the security of Midori64 against truncated differential and related-key differential attacks. By studying the compact representation of Midori64, we get the branching distribution properties of...

متن کامل

Search for Impossible Differential of E2

This paper studies the search for the impossible differentials of E2. We apply the Shrinking technique, the miss-in-the-middle technique, and a new search algorithm to E2. As a result, no impossible differential is found for E2 with more than 5 rounds. We conclude that E2 is secure against cryptanalysis using impossible differentials derived by the currently known techniques.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012